Adenomatoid hyperplasia of palatal minor salivary glands

Adenomatoid hyperplasia of palatal minor mucous glands is rare but significant because the clinical appearance mimics malignant disease. The typical history of a painless, indolent palatal swelling, together with the histological picture of benign glandular hyperplasia and hypertrophy, are illustrated in this report

Combining High-Impact Practices to Facilitate Hope for Young Adults Transitioning into College

Today’s societal challenges are causing young people to feel less hopeful about the future, negatively impacting their mental health. Educators are called to address this crisis and provide opportunities for young people to experience hope. Jesuit colleges and universities are uniquely poised to do so given their focus on caring for the whole person and the recent release of the Universal Apostolic Preferences, which prioritize “journeying with youth in the creation of a hope-filled future.” High-impact practices at Jesuit institutions could particularly be effective given the ways in which they intellectually engage students and help students cultivate a sense of belonging. Therefore, this study examines the combination of two high-impact practices (first-year seminars/experiences and service-learning) at The College of the Holy Cross to better understand if and how they facilitate and cultivate hope. Findings indicate that first-year seminars with a service-learning component do positively impact students’ sense of hope for the future because of the ways they help students: connect with others; witness individuals and institutions who are impacting change; increase their confidence and feeling of worthiness; develop a sense of purpose and understanding of mission; and reflect on and live out their personal values

Out of Africa: A Molecular Perspective on the Introduction of Yellow Fever Virus into the Americas

Yellow fever virus (YFV) remains the cause of severe morbidity and mortality in South America and Africa. To determine the evolutionary history of this important reemerging pathogen, we performed a phylogenetic analysis of the largest YFV data set compiled to date, representing the prM/E gene region from 133 viral isolates sampled from 22 countries over a period of 76 years. We estimate that the currently circulating strains of YFV arose in Africa within the last 1,500 years and emerged in the Americas following the slave trade approximately 300–400 years ago. These viruses then spread westwards across the continent and persist there to this day in the jungles of South America. We therefore illustrate how gene sequence data can be used to test hypotheses of viral dispersal and demographics, and document the role of human migration in the spread of infectious disease

A Unified Approach for the Integration of Distributed Heterogeneous Software Components

Proceedings of the 2001 Monterey Workshop (Sponsored by DARPA, ONR, ARO and AFOSR), pp: 109-119, Monterey, CA, 2001Distributed systems are omnipresent these days. Creating efficient and robust software for such systems is a highly complex task. One possible approach to developing distributed software is based on the integration of heterogeneous sofwtare components that are scattered across many machines. In this paper, a comprehensive framework that will allow a seamless integration of distributed heterogeneous software components is proposed. This framework involves: a) a metamodel for components and associated hierarchical setup for indicating the contracts and constraints of the components. b) an automatic generation of glues and wrappers, based on a designer's specifications, for achieving interoperability, c) a formal mechanism for precisely describing the meta-model, and d) a formalization of quality of service (QoS) offered by each component and ensemble of components. A case study from the domain of distributed information filtering is described in the context of this framework.This material is based upon work supported by, or in part by, the U.S. Office of Naval Research under award number N00014-01-1-0746. This material is based upon work supported by, or in part by, the U.S. Army Research Laboratory and the U.S. Army Research Office under contract/grant number 40473-MA

KSU Chorale and Men\u27s Ensemble

The KSU Chorale and Men\u27s Ensemble, under the direction of Dr. Reid Masters, present their fall concert featuring the works of Clemons non Papa and Peter Hamlin.https://digitalcommons.kennesaw.edu/musicprograms/2317/thumbnail.jp

Challenges and Directions in Formalizing the Semantics of Modeling Languages

Developing software from models is a growing practice and there exist many model-based tools (e.g., editors, interpreters, debuggers, and simulators) for supporting model-driven engineering. Even though these tools facilitate the automation of software engineering tasks and activities, such tools are typically engineered manually. However, many of these tools have a common semantic foundation centered around an underlying modeling language, which would make it possible to automate their development if the modeling language specification were formalized. Even though there has been much work in formalizing programming languages, with many successful tools constructed using such formalisms, there has been little work in formalizing modeling languages for the purpose of automation. This paper discusses possible semantics-based approaches for the formalization of modeling languages and describes how this formalism may be used to automate the construction of modeling tools

New results on rewrite-based satisfiability procedures

Program analysis and verification require decision procedures to reason on theories of data structures. Many problems can be reduced to the satisfiability of sets of ground literals in theory T. If a sound and complete inference system for first-order logic is guaranteed to terminate on T-satisfiability problems, any theorem-proving strategy with that system and a fair search plan is a T-satisfiability procedure. We prove termination of a rewrite-based first-order engine on the theories of records, integer offsets, integer offsets modulo and lists. We give a modularity theorem stating sufficient conditions for termination on a combinations of theories, given termination on each. The above theories, as well as others, satisfy these conditions. We introduce several sets of benchmarks on these theories and their combinations, including both parametric synthetic benchmarks to test scalability, and real-world problems to test performances on huge sets of literals. We compare the rewrite-based theorem prover E with the validity checkers CVC and CVC Lite. Contrary to the folklore that a general-purpose prover cannot compete with reasoners with built-in theories, the experiments are overall favorable to the theorem prover, showing that not only the rewriting approach is elegant and conceptually simple, but has important practical implications.Comment: To appear in the ACM Transactions on Computational Logic, 49 page